Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2008, Vol. 31 ›› Issue (6): 5-8.doi: 10.13190/jbupt.200806.5.197

• Papers • Previous Articles     Next Articles

Secure Two-party Computation Protocols for Mapping-equivalence Problem

MA Min-yao1, LUO Shou-shan1,2, WANG Li-cheng1   

  1. (1.National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2.School of Software Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China)
  • Received:2008-03-29 Revised:2008-06-19 Online:2008-12-31 Published:2008-12-31
  • Contact: MA Min-yao

Abstract:

Secure multi-party computation protocol allows a set of -parties to evaluate a joint function of their inputs such that the function is calculated correctly and furthermore no information about their inputs is revealed by the output of the function. Based on the determinate-commutative cryptosystem and under the semi-honest model hypothesis, secure two-party computation protocols for determine whether an element is belong to a certain finite set, whether two finite sets are equal, and whether two equivalence relations are equal are considered. A mathematic method, relates to kernel, image and kernel-classes of mapping, to determine whether two mappings are equal is introduced. Furthermore, two-party computation protocol for determine whether two mappings are equal is given. Correctness, security, and efficiency of our protocols are analyzed.

Key words: cryptography, secure two-party computation, equivalent relation, mapping, finite full transformation semigroup

CLC Number: